Solvable Monoids with Commuting Idempotents
نویسندگان
چکیده
The notion of Abelian kernel of a finite monoid extends the notion of derived subgroup of a finite group. In this line, an extension of the notion of solvable group to monoids is quite natural: they are the monoids such that the chain of Abelian kernels ends with the submonoid generated by the idempotents. We prove in this paper that the finite idempotent commuting monoids satisfying this property are precisely those whose subgroups are solvable. Introduction The computability of the kernel KH(M) of a finite monoid M relative to a pseudovariety H of groups is closely related to the decidability of Mal’cev products where the second factor is a pseudovariety of groups. In fact, for a decidable pseudovariety V of monoids and a pseudovariety H of groups, being able to compute KH(M), for any finite monoid M , automatically guarantees the decidability of the pseudovariety of monoids V ©m H = {M finite monoid | KH(M) ∈ V} which is well-known to be the Mal’cev product of V and H. As the Mal’cev product of pseudovarieties of monoids interests many researchers, the importance of computing kernels is out of question. The popularity of the kernel notion comes from a conjecture of J. Rhodes that proposed an algorithm to perform the computation of the kernel relative to the pseudovariety of all finite groups. It is known as the Rhodes Type II Conjecture and survived as a conjecture almost 20 years. It became a theorem after independent and deep work of Ash [7] and Ribes and Zalesskĭı [22]. The history and some consequences of the Type II Conjecture may be found in [15]. The results of Ash and of Ribes and Zalesskĭı that led to its proof have since then been extended in various directions [6, 16, 3, 4] and several connections between both results have also been found [11, 16, 3, 4]. The Abelian counterpart of the Rhodes Type II Conjecture was solved by the first author in [9] and the algorithm there obtained to compute the Abelian kernel of a finite The author gratefully acknowledges support of FCT through the Centro de Matemática da Universidade do Porto and the FCT and POCTI Project POCTI/32817/MAT/2000 which is funded in cooperation with the European Community Fund FEDER and of project INTAS 99-1224. The author gratefully acknowledges support of FCT and FEDER, within the project “Álgebra e Aplicações”, POCTI/32440/MAT/1999, of Centro de Álgebra da Universidade de Lisboa.
منابع مشابه
On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents
Eilenberg has shown that there is a one-to-one correspondence between varieties of finite monoids and varieties of recognizable languages. In this paper, we give a description of a variety of languages close to the class of piecewise testable languages considered by I. Simon. The corresponding variety of monoids is the variety of J -trivial monoids with commuting idempotents. This result is the...
متن کاملCommuting Idempotents of an H∗-algebra
Commutative H *-algebra is characterized in terms of idempotents. Here we offer three characterizations. 1. Introduction. In the past, the author used commuting idempotents to characterize continuous functions defined on a certain space [3, 4]. For example , it was shown in [3] that a certain Banach algebra is isometrically isomorphic to the space C(S) of all continuous complex-valued functions...
متن کاملCommuting Idempotents, Square-free Modules, and the Exchange Property
We give a criterion for when idempotents of a ring R which commute modulo the Jacobson radical J(R) can be lifted to commuting idempotents of R. If such lifting is possible, we give extra information about the lifts. A “half-commuting” analogue is also proven, and this is used to give sufficient conditions for a ring to have the internal exchange property. In particular, we show that if R/J(R) ...
متن کاملOn Kiselman Quotients of 0-hecke Monoids
Combining the definition of 0-Hecke monoids with that of Kiselman semigroups, we define what we call Kiselman quotients of 0-Hecke monoids associated with simply laced Dynkin diagrams. We classify these monoids up to isomorphism, determine their idempotents and show that they are J -trivial. For type A we show that Catalan numbers appear as the maximal cardinality of our monoids, in which case ...
متن کاملThe Idempotent Problem for an Inverse Monoid
We generalize the word problem for groups, the formal language of all words in the generators that represent the identity, to inverse monoids. In particular, we introduce the idempotent problem, the formal language of all words representing idempotents, and investigate how the properties of an inverse monoid aer related to the formal language properties of its idempotent problem. In particular,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 15 شماره
صفحات -
تاریخ انتشار 2005